排序方式: 共有193条查询结果,搜索用时 15 毫秒
91.
92.
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
93.
面向对等网络信息资源语义共享问题,首先提出了一种基于多本体的资源元数据描述框架,将资源元数据分为核心和扩展两部分,在此基础上重点对资源元数据索引策略进行了研究,提出了一种混合索引机制,针对资源核心元数据采用一种社区策略来进行组织索引,针对扩展元数据采取DHT和语义关联相结合的方式进行组织索引,其中结合了本地索引和全局索引的特点,并在此基础上对资源发现流程和负载均衡方法进行了设计。与现有相关系统相比,本索引体系有效地提高了对等网络环境下资源定位的效率和系统的可扩展能力。 相似文献
94.
分析了装备一体化设计过程中维修性约束及维修性冲突的特点。在此基础上,结合并行设计、协同设计领域内的相关研究,提出了基于约束和实例的维修性冲突解决方法,该方法发扬了约束法和实例法解决冲突的优势,弥补了单一解决方案存在的不足。最后以某型飞机电动机设计为例对该方法进行了说明。 相似文献
95.
新疆地大物博,有着发展农业的资源优势,只有抓住“西部大开发”这个机遇,以市场为导向,加大产业 结构调整力度,积极推进农业产业化进程,以保护生态环境为前提,发展生态农业,才能促进新疆农业可持续发展。 相似文献
96.
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks 下载免费PDF全文
Noam Goldberg 《海军后勤学研究》2017,64(2):139-153
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017 相似文献
97.
论火灾与可持续发展观的内在联系 总被引:1,自引:0,他引:1
蔡畅宇 《中国人民武装警察部队学院学报》2001,17(6):29-33
可持续发展是人类迫切解决的问题,火灾对可持续发展构成巨大威胁.针对火灾的危害,从防灾角度研究可持续发展观,揭示火灾与可持续发展的内在联系,为人类有效控制火灾提供正确的认识论和科学的方法论. 相似文献
98.
We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献
99.
We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
100.
为使舰炮制导炮弹在打击近岸机动目标的末制导段满足落角约束,考虑驾驶仪动态特性,基于自适应径向基逼近网络与动态面提出一种空间末制导律。构建弹目相对运动模型,通过带改进微分跟踪器的扩张状态观测器估计目标加速度。为零化视线角跟踪误差与角速率,采用自适应指数趋近律设计非奇异终端滑模,运用自适应径向基逼近网络削弱控制指令抖振。通过Lyapunov第二法证明了系统的视线角跟踪误差与视线角速率均最终一致有界。仿真实验表明:该末制导律使制导炮弹在空间中打击不同机动形式的近岸目标时,具备良好的末制导性能。 相似文献